Smoothing Technique and its Applications in Semidefinite Optimization
نویسنده
چکیده
In this paper we extend the smoothing technique [7], [9] onto the problems of Semidefinite Optimization. For that, we develop a simple framework for estimating a Lipschitz constant for the gradient of some symmetric functions of eigenvalues of symmetric matrices. Using this technique, we can justify the Lipshitz constants for some natural approximations of maximal eigenvalue and the spectral radius of symmetric matrices. We analyze the complexity of the problem-oriented gradient-type schemes onto the problems of minimizing the maximal eigenvalue or the spectral radius of the matrix, which depends linearly on the design variables. We show that in the first case the number of iterations of the method is bounded by O(12 ), where 2 is the required absolute accuracy of the problem. In the second case, the number of iterations is bounded by 4δ √ (1 + δ)r ln r, where δ is the required relative accuracy and r is the maximal rank of corresponding linear matrix inequality. Thus, the latter method is a fully polynomial approximation scheme.
منابع مشابه
A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
We study a smoothing Newton method for solving a nonsmooth matrix equation that includes semidefinite programming and the semidefinite complementarity problem as special cases. This method, if specialized for solving semidefinite programs, needs to solve only one linear system per iteration and achieves quadratic convergence under strict complementarity and nondegeneracy. We also establish quad...
متن کاملSmoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form
Semidefinite programs (SDP) are important in learning and combinatorial optimization with numerous applica-tions. In pursuit of low-rank solutions and low complexity algorithms, we consider the Burer–Monteiro factorizationapproach for solving SDPs. We show that all approximate local optima are global optima for the penalty formulationof appropriately rank-constrained SDPs as long as...
متن کاملQuadratic Convergence of a Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
We study a smoothing Newton method for solving a nonsmooth matrix equation that includes semidefinite programming and the semidefinte complementarity problem as special cases. This method, if specialized for solving semidefinite programs, needs to solve only one linear system per iteration and achieves quadratic convergence under strict complementarity. We also establish quadratic convergence o...
متن کاملCorrigendum: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
We correct an error in Lemma 4.2 of [Kanzow and Nagel, Semidefinite programs: New search directions, smoothing-type methods, and numerical results, SIAM J. Optim 13, 2003, pp. 1–23]. With this correction, all results in that paper remain true.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 110 شماره
صفحات -
تاریخ انتشار 2007